翻訳と辞書 |
Cell-probe model : ウィキペディア英語版 | Cell-probe model In computer science, the cell-probe model is a model of computation similar to the Random-access machine, except that all operations are free except memory access. This model is useful for proving lower bounds of algorithms for data structure problems. == Overview == The cell-probe model is a minor modification of the Random-access machine model, itself a minor modification of the Counter machine model, in which computational cost is only assigned to accessing units of memory called cells. In this model, computation is framed as a problem of querying a set of memory cells. The problem has two phases: the preprocessing phase and the query phase. The input to the first phase, the preprocessing phase, is a set of data from which to build some structure from memory cells. The input to the second phase, the query phase, is a query datum. The problem is to determine if the query datum was included in the original input data set. Operations are free except to access memory cells. This model is useful in the analysis of data structures. In particular, the model clearly shows a minimum number of memory accesses to solve a problem in which there is stored data on which we would like to run some query. An example of such a problem is the dynamic partial sum problem.
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Cell-probe model」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|